Fixed-Base Comb with Window-Non-Adjacent Form (NAF) Method for Scalar Multiplication
نویسندگان
چکیده
منابع مشابه
Fixed-Base Comb with Window-Non-Adjacent Form (NAF) Method for Scalar Multiplication
Elliptic curve cryptography (ECC) is one of the most promising public-key techniques in terms of short key size and various crypto protocols. For this reason, many studies on the implementation of ECC on resource-constrained devices within a practical execution time have been conducted. To this end, we must focus on scalar multiplication, which is the most expensive operation in ECC. A number o...
متن کاملSetting Speed Records with the (Fractional) Multibase Non-Adjacent Form Method for Efficient Elliptic Curve Scalar Multiplication
In this paper, we introduce the Fractional Window-w Multibase NonAdjacent Form (Frac-wmbNAF) method to perform the scalar multiplication. This method generalizes the recently developed Window-w mbNAF (wmbNAF) method by allowing an unrestricted number of precomputed points. We then make a comprehensive analysis of the most recent and relevant methods existent in the literature for the ECC scalar...
متن کاملNew Multibase Non-Adjacent Form Scalar Multiplication and its Application to Elliptic Curve Cryptosystems (extended version)
Patrick Longa is with the Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, Canada (e-mail: [email protected]). Ali Miri is with the School of Information and Technology Engineering (SITE), University of Ottawa, Ottawa, Canada (e-mail: [email protected]). Abstract. In this paper we present a new method for scalar multiplication that uses a generic multi...
متن کاملScalar Multiplication on Koblitz Curves using tau2-NAF
The paper proposes a τ−NAF method for scalar multiplication on Koblitz curves, which requires asymptotically 0.215m point additions in GF (2). For τ−NAF method, point quading operation (a→ a) is performed instead of point squarings. The proposed method is faster than normal τ−NAF method, which requires around m 3 point additions. However, like width w based τ−NAF methods, there is an overhead o...
متن کاملDouble-base scalar multiplication revisited
This paper reduces the number of field multiplications required for scalar multiplication on conservative elliptic curves. For an average 256-bit integer n, this paper’s multiply-by-n algorithm takes just 7.47M per bit on twisted Edwards curves −x + y = 1 + dxy with small d. The previous record, 7.62M per bit, was unbeaten for seven years. Unlike previous record-setting algorithms, this paper’s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Sensors
سال: 2013
ISSN: 1424-8220
DOI: 10.3390/s130709483